Complexity classes - PDFSEARCH.IO - Document Search Engine

Complexity classes
Results: 1120

#	Item
991	In Search of an Easy Witness: Exponential Time vs. Probabilistic Polynomial Time Russell Impagliazzo∗ Add to Reading List Source URL: www.math.ias.edu Language: English - Date: 2003-11-18 15:48:52 Complexity classes Computational resources Pseudorandomness Analysis of algorithms Advice Bounded-error probabilistic polynomial NTIME Pseudorandom generator Circuit complexity Theoretical computer science Computational complexity theory Applied mathematics
992	Probabilistic Checking of Proofs and Hardness of Approximation Problems Add to Reading List Source URL: www.cs.princeton.edu Language: English - Date: 2005-03-10 11:31:01 Probabilistic complexity theory Mathematical optimization Probabilistically checkable proof Sanjeev Arora PCP theorem Complexity classes MAX-3SAT Hardness of approximation NP Theoretical computer science Applied mathematics Computational complexity theory
993	Languages That Capture Complexity Classes Neil Immermany Add to Reading List Source URL: people.cs.umass.edu Language: English - Date: 2004-05-13 16:27:49 FO L Transitive closure P SO Complexity classes Applied mathematics Mathematics
994	The G¨odel Prize 2010 Laudatio for S. Arora and J.S.B. Mitchell The G¨odel Prize 2010 is awarded to Sanjeev Arora and Joseph S.B. Mitchell Add to Reading List Source URL: www.eatcs.org Language: English - Date: 2010-06-16 06:52:36 Complexity classes Sanjeev Arora Polynomial-time approximation scheme Travelling salesman problem Approximation algorithm PTAS NP APX Joseph S. B. Mitchell Theoretical computer science Computational complexity theory Applied mathematics
995	The Design of Approximation Algorithms Add to Reading List Source URL: www.designofapproxalgs.com Language: English - Date: 2013-10-23 21:30:01 NP-complete problems Operations research Combinatorial optimization Mathematical optimization Complexity classes NP-complete Maximum cut Approximation algorithm Algorithm Theoretical computer science Mathematics Computational complexity theory
996	An Argument for P=NP Selmer Bringsjord & Joshua Taylor∗ Department of Cognitive Science Add to Reading List Source URL: kryten.mm.rpi.edu Language: English - Date: 2006-08-15 08:38:25 Complexity classes Computability theory Theory of computation Mathematical optimization NP-complete P versus NP problem NP P Halting problem Theoretical computer science Computational complexity theory Applied mathematics
997	The KnowledgeComplexity of Interactive Proof-Systems (ExtendedAbstract) ShafiGoldwasser SilvioMicali CharlesRackoff Add to Reading List Source URL: groups.csail.mit.edu Language: English - Date: 2003-11-26 11:19:12 Complexity classes Probabilistic complexity theory NP IP Interactive proof system Bounded-error probabilistic polynomial PP Randomized algorithm XTR Theoretical computer science Computational complexity theory Applied mathematics
998	i Computational Complexity: A Modern Add to Reading List Source URL: www.cs.princeton.edu Language: English - Date: 2007-01-08 22:00:26 Complexity classes NP P versus NP problem Cook–Levin theorem P Boolean satisfiability problem Reduction Time complexity Co-NP-complete Theoretical computer science Computational complexity theory Applied mathematics
999	offprint from: M ixail N. Bogoljubov et al. (eds.): Indoiranskoe jazykoznanie i tipologija jazykovyx situacij. Sbornik statej k 75-letiju professora A. L. Grjunberga[removed]St. Petersburg: Nauka, pp[removed] Add to Reading List Source URL: titus.uni-frankfurt.de Language: English - Date: 2011-10-17 10:18:29 Iranian peoples Complexity classes Mathematical optimization Ethnic groups in Pakistan Balochi language P versus NP problem NP Baloch people Iranian languages Theoretical computer science Asia Balochistan
1000	Light Up is NP-complete Brandon McPhail February 28, 2005 Add to Reading List Source URL: people.cs.umass.edu Language: English - Date: 2007-09-02 12:14:45 Complexity classes NP-complete Boolean algebra NP PP UP P Reduction Arithmetic circuit complexity Theoretical computer science Computational complexity theory Applied mathematics

UPDATE